Karhunen-Loeve Transform and Sparse Representation Based Plant Leaf Disease Recognition

نویسندگان

  • Jie Tian
  • Qiu-xia Hu
  • Xiao-yi Ma
چکیده

To improve the classification accuracy rate of apple leaf disease images and solve the problem of dimension redundancy in feature extraction, Karhunen-Loeve (K-L) transform and sparse representation are applied to apple leaf disease recognition. Firstly 9 color features and 8 texture features of disease leaf images are extracted and taken as feature vectors after dimensionality reduction by the K-L transform. Then, for each of apple mosaic virus, apple rust and apple alternaria leaf spot, 40 apple leaf images are selected as the training samples, whose feature vectors are made up of the dictionary of the sparse representation, respectively. Each testing sample is classified into the class with the minimal residual. The identifying results using the proposed method are analyzed and compared with those of the Support Vector Machine (SVM) and original sparse representation method. The average classification accuracy rate of the proposed method is 94.18%, which confirms its good robustness. In addition, the proposed method not only improves the plant leaf disease classification accuracy but also solves the redundancy problem of the extracted features.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified Mfcc Methods Based on Kl- Transform and Power Law for Robust Speech Recognition

This paper presents robust feature extraction techniques, called Mel Power Karhunen Loeve Transform Coefficients (MPKC), Mel Power Coefficients (MPC) for an isolated digit recognition. This hybrid method involves Stevens’ Power Law of Hearing and Karhunen Loeve(KL) Transform to improve noise robustness. We have evaluated the proposed methods on a Hidden Markov Model (HMM) based isolated digit r...

متن کامل

Compression of image clusters using Karhunen Loeve transformations

This paper proposes to extend the Karhunen-Loeve compression algorithm to multiple images. The resulting algorithm is compared against single-image Karhunen Loeve as well as algorithms based on the Discrete Cosine Transformation (DCT). Futhermore, various methods for obtaining compressable clusters from large image databases are evaluated.

متن کامل

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

Use of Fourier and Karhunen-Loeve Decomposition for Fast Pattern Matching With a Large Set of Templates

We present a fast pattern matching algorithm with a large set of templates. The algorithm is based on the typical template matching speeded up by the dual decomposition; the Fourier transform and the Karhunen-Loeve transform. The proposed algorithm is appropriate for the search of an object with unknown distortion within a short period. Patterns with different distortion differ slightly from ea...

متن کامل

Sparse time-frequency representation of speech by the vandermonde transform

Efficient speech signal representations are prerequisite for efficient speech processing algorithms. The Vandermonde transform is a recently introduced time-frequency transform which provides a sparse and uncorrelated speech signal representation. In contrast, the Fourier transform only decorrelates the signal approximately. To achieve complete decorrelation, the Vandermonde transform is signal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013